Degree-constrained edge partitioning in graphs arising from discrete tomography
نویسندگان
چکیده
منابع مشابه
Degree-constrained edge partitioning in graphs arising from discrete tomography
Starting from the basic problem of reconstructing a 2-dimensional image given by its projections on two axes, one associates a model of edge coloring in a complete bipartite graph. The complexity of the case with k = 3 colors is open. Variations and special cases are considered for the case k = 3 colors where the graph corresponding to the union of some color classes (for instance colors 1 and ...
متن کاملPartitioning Graphs of Regular Degree
Graph-Partitioning problems occur in a wide range of applications. The task is to divide the vertices of a graph in equally sized parts such that as few edges as possible are crossing the boundaries. The calculation of an optimal result is NP-complete. We show a new strategy to derive upper bounds on the bisection width of graphs with regular degree. It gives optimal upper bounds for very small...
متن کاملDegree-constrained editing of small-degree graphs
This thesis deals with degree-constrained graph modification problems. In particular, we investigate the computational complexity of DAG Realization and Degree Anonymity. The DAG Realization problem is, given a multiset of positive integer pairs, to decide whether there is a realizing directed acyclic graph (DAG), that is, pairs are one-to-one assigned to vertices such that the indegree and the...
متن کاملDepth of Edge Rings Arising from Finite Graphs
Let G be a finite graph and K[G] the edge ring of G. Based on the technique of Gröbner bases and initial ideals, it will be proved that, given integers f and d with 7 ≤ f ≤ d, there exists a finite graphG on [d] = {1, . . . , d} with depthK[G] = f and with Krull-dimK[G] = d.
متن کاملOn a graph coloring problem arising from discrete tomography
An extension of the basic image reconstruction problem in discrete tomography is considered: given a graph G = (V, E) and a family P of chains Pi together with vectors h(Pi) = (h 1 i , ..., h k i ), one wants to find a partition V , ..., V k of V such that for each Pi and each color j, |V ∩Pi| = hji . An interpretation in terms of scheduling is presented. We consider special cases of graphs and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2009
ISSN: 1526-1719
DOI: 10.7155/jgaa.00178